Competitive Algorithms for Online Leasing Problem in Probabilistic Environments
نویسندگان
چکیده
We integrate probability distribution into pure competitive analysis to improve the performance measure of competitive analysis, since input sequences of the leasing problem have simple structure and favorably statistical property. Let input structures be the characteristic of geometric distribution, and we obtain optimal on-line algorithms and their competitive ratios. Moreover, the introducing of interest rate would diminish the uncertainty involved in the process of decision making and put off the optimal purchasing date.
منابع مشابه
On the on-line rent-or-buy problem in probabilistic environments
Fujiwara and Iwama [In: The 13th Annual International Symposium on Algorithms andComputation, pp. 476–488 (2002)] first integrated probability distribution into the classical competitive analysis to study the rental problem. They assumed that the future inputs are drawn from an exponential distribution, and obtained the optimal competitive strategy and the competitive ratio by the derivative me...
متن کاملCompetitive strategy for on-line leasing of depreciable equipment
This paper studies the problem of on-line leasing of depreciable equipment. We first discuss deterministic strategies for the problem for situations with and without interest rates, respectively. Competitive ratios are used to evaluate the performance of online algorithms. The optimal competitive ratio of the deterministic strategy is therefore obtained. As randomization can boost performance, ...
متن کاملCompetitive Analysis for Online Leasing Problem with Compound Interest Rate
and Applied Analysis 3 defined the same as 1.1 with Coston I;A replaced by E Coston I;A , which is the expected value of A’s cost on input I. The online leasing problem has been investigated by many authors 13–15 . For the continuous version, the optimal deterministic and randomized competitive ratios are 2 and e/ e − 1 ≈ 1.582, respectively 2, 3 . When considering alternative financial decisio...
متن کاملConnected Facility Leasing Problems
We study leasing variants of the connected facility location problem, in which we wish to connect a set of clients to facilities, and facilities are connected via core edges, whose cost is a scale factor times the cost of a simple edge. We identify two aspects of the problem that can lead to different variants: (a) if there is a single or multiple commodities, and (b) if we lease facilities and...
متن کاملOffline and Online Facility Leasing
We study the problem of leasing facilities over time, following the general infrastructure leasing problem framework introduced by Anthony and Gupta [1]. If there are K different lease types, Anthony and Gupta give an O(K)-approximation algorithm for the problem. We are able to improve this to a 3-approximation algorithm by using a variant of the primal-dual facility location algorithm of Jain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004